Finding constrained and weighted Voronoi diagrams in the plane
نویسندگان
چکیده
منابع مشابه
Capacity-constrained Voronoi Diagrams in Finite Spaces
A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams in which the capacities are given as constraints. We compute such capacity-constrained Voronoi diagrams in finite spaces by starting with an arbitrary partition that fulfills the capacity constraint wit...
متن کاملDynamic Additively Weighted Voronoi Diagrams in 2D
In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points on the plane. The novelty in our approach is that we use the dual of the additively weighted Voronoi diagram to represent it. This permits us to perform both insertions and deletions of sites easily. Given a set B of n sites, among which h sites have non-empty...
متن کاملA note on visibility-constrained Voronoi diagrams
We consider a variant of visibility-constrained Voronoi diagrams for n given point sites in the Euclidean plane. Whereas such diagrams typically are of size Ω(n2), the combinatorial and algorithmic complexity of the studied variant is significantly subquadratic in n. © 2014 Elsevier B.V. All rights reserved.
متن کاملA Subdivision Approach to Weighted Voronoi Diagrams
Voronoi diagrams are a central topic in Computational Geometry. They can be generalized in many ways. Suppose S is a finite set of geometric objects and there is a notion of Voronoi diagram V or(S) that we want to compute. One approach to designing algorithms for V or(S) is to (1) assume some general properties of S, and (2) describe an abstract algorithm based on the Real RAM model that has so...
متن کاملVoronoi Diagrams of Moving Points in the Plane
The combinatorial complexities of (1) the Voronoi diagram of moving points in 2D and (2) the Voronoi diagram of lines in 3D, both under the Euclidean metric, continues to challenge geometers because of the open gap between the (n2) lower bound and the O(n3+ε) upper bound. Each of these two combinatorial problems has a closely related problem involving Minkowski sums: (1′) the complexity of a Mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00028-x